Several Explicit and Recursive Formulas for the Generalized Motzkin Numbers

نویسنده

  • FENG QI
چکیده

In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two explicit formulas for the generalized Motzkin numbers

In the paper, by the Faà di Bruno formula, the authors establish two explicit formulas for the Motzkin numbers, the generalized Motzkin numbers, and the restricted hexagonal numbers.

متن کامل

On the structural properties for the cross product of fuzzy numbers with applications

In the fuzzy arithmetic, the definitions of addition and multiplication of fuzzy numbers are based on Zadeh’s extension principle. From theoretical and practical points of view, this multiplication of fuzzy numbers owns several unnatural properties. Recently, to avoid this shortcoming, a new multiplicative operation of product type is introduced, the so-called cross-product of fuzzy numbers. Th...

متن کامل

ECO method and hill-free generalized Motzkin paths

In this paper we study the class of generalized Motzkin paths with no hills and prove some of their combinatorial properties in a bijective way; as a particular case we have the Fine numbers, enumerating Dyck paths with no hills. Using the ECO method, we define a recursive construction for Dyck paths such that the number of local expansions performed on each path depends on the number of its hi...

متن کامل

A Classification of Motzkin Numbers Modulo 8

The well-known Motzkin numbers were conjectured by Deutsch and Sagan to be nonzero modulo 8. The conjecture was first proved by Sen-Peng Eu, Shu-chung Liu and Yeong-Nan Yeh by using the factorial representation of the Catalan numbers. We present a short proof by finding a recursive formula for Motzkin numbers modulo 8. Moreover, such a recursion leads to a full classification of Motzkin numbers...

متن کامل

Combinatorics of Generalized Motzkin Numbers

The generalized Motzkin numbers are common generalizations of the Motzkin numbers and the Catalan numbers. We investigate their combinatorial properties, including the combinatorial interpretation, the recurrence relation, the binomial transform, the Hankel transform, the log-convexity, the continued fraction of the generating function, and the total positivity of the corresponding Hankel matrix.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017